Directional Derivatives in Set Optimization with the Set Less Order Relation

نویسنده

  • Johannes Jahn
چکیده

Based on a special concept of the difference of sets, a new notion of the directional derivative of a set-valued map is presented. This theory is applied to set optimization problems with the known set less order relation, and it results in necessary and sufficient optimality conditions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Use of Volsurf approach for pharmacokinetic optimization of β-carboline derivatives as antitumor agents

The β-carboline derivatives are a large group of naturally-occurring and synthetic alkaloids which have awide spectrum of biological and pharmaceutical properties. The newly developed procedure called VolSurfhas been used to explore a significant correlation between the 3D molecular interaction fields (MIF) andphysicochemical and pharmacokinetic properties of a set of 30 β-carboline compounds a...

متن کامل

Complete Closest-Target Based Directional FDH Measures of Efficiency in DEA

In this paper, we aim to overcome three major shortcomings of the FDH (Free Disposal Hull) directional distance function through developing two new, named Linear and Fractional CDFDH, complete FDH measures of efficiency. To accomplish this, we integrate the concepts of similarity and FDH directional distance function. We prove that the proposed measures are translation invariant and unit invari...

متن کامل

Differential Characteristics of Efficient Frontiers in DEA with Weight Restrictions

The non-differentiability and implicit definition of boundary of production possibility set (PPS) in data envelopment analysis (DEA) are two important difficulties for obtaining directional characteristics, including different elasticity measures and marginal rates of substitution. Also, imposing weight restrictions in DEA models have some shortcomings and misunderstandings. In this paper we ut...

متن کامل

RESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM

This paper studies the nonlinear optimization problems subject to bipolar max-min fuzzy relation equation constraints. The feasible solution set of the problems is non-convex, in a general case. Therefore, conventional nonlinear optimization methods cannot be ideal for resolution of such problems. Hence, a Genetic Algorithm (GA) is proposed to find their optimal solution. This algorithm uses th...

متن کامل

First-order optimality conditions in set-valued optimization

A a set-valued optimization problem minC F (x), x ∈ X0, is considered, where X0 ⊂ X , X and Y are Banach spaces, F : X0 Y is a set-valued function and C ⊂ Y is a closed cone. The solutions of the set-valued problem are defined as pairs (x, y), y ∈ F (x), and are called minimizers. In particular the notions ofw-minimizer (weakly efficient points), p-minimizer (properly efficient points) and i-mi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014